Dynamic well-spaced point sets
نویسندگان
چکیده
منابع مشابه
Construction of Sparse Well-spaced Point Sets for Quality Tetrahedralizations
We propose a new mesh refinement algorithm for computing quality guaranteed Delaunay triangulations in three dimensions. The refinement relies on new ideas for computing the goodness of the mesh, and a sampling strategy that employs numerically stable Steiner points. We show through experiments that the new algorithm results in sparse well-spaced point sets which in turn leads to tetrahedral me...
متن کاملSuccinct Representation of Well-Spaced Point Clouds
A set of n points in low dimensions takes Θ(nw) bits to store on a w-bit machine. Surface reconstruction and mesh refinement impose a requirement on the distribution of the points they process. I show how to use this assumption to lossily compress a set of n input points into a representation that takes only O(n) bits, independent of the word size. The loss can keep inter-point distances to wit...
متن کاملNear-Linear-Time Deterministic Plane Steiner Spanners and TSP Approximation for Well-Spaced Point Sets
We describe an algorithm that takes as input n points in the plane and a parameter , and produces as output an embedded planar graph having the given points as a subset of its vertices in which the graph distances are a (1 + )-approximation to the geometric distances between the given points. For point sets in which the Delaunay triangulation has bounded sharpest angle, our algorithm’s output h...
متن کامل1A.4 Construction of Sparse Well-spaced Point Sets for Quality Tetrahedralizations
We propose a new mesh refinement algorithm for computing quality guaranteed Delaunay triangulations in three dimensions. The refinement relies on new ideas for computing the goodness of the mesh, and a sampling strategy that employs numerically stable Steiner points. We show through experiments that the new algorithm results in sparse well-spaced point sets which in turn leads to tetrahedral me...
متن کاملNear-linear-time deterministic plane Steiner spanners for well-spaced point sets
We describe an algorithm that takes as input n points in the plane and a parameter , and produces as output an embedded planar graph having the given points as a subset of its vertices in which the graph distances are a (1 + )-approximation to the geometric distances between the given points. For point sets in which the Delaunay triangulation has sharpest angle α, our algorithm’s output has O( ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2013
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2012.11.007